Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems
نویسندگان
چکیده
Hybrid systems are dynamic systems with interacting discrete computation and continuous physical processes, which have become more common, more indispensable, and more complicated in our modern life. Particularly, many of them are safety-critical, and therefore are required to meet a critical safety standard. Invariant generation plays a central role in the verification and synthesis of hybrid systems. In our previous work, we gave a necessary and sufficient condition for a semi-algebraic set being an invariant of a polynomial autonomous dynamical system, which gave a confirmative answer to the open problem. In addition, based on which a complete algorithm for generating all semi-algebraic invariants of a given polynomial autonomous hybrid system with the given shape was proposed. In this paper, we consider how to extend our previous work to non-autonomous dynamical and hybrid systems. Non-autonomous dynamical and hybrid systems are with inputs, which are very common in practice; in contrast, autonomous ones are without inputs. Furthermore, we present a sound and complete algorithm to verify semi-algebraic invariants for non-autonomous polynomial hybrid systems. Based WANG Qiuye, Yangjia Li and Naijun Zhan State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China E-mail : {wangqye,yangjia,znj}@ios.ac.cn XIA Bican LMAM & School of Math. Sci., Peking University, Beijing, China E-mail : [email protected] ∗ The first, second and fourth authors are supported partly by “973 Program” under grant No. 2014CB340701, by NSFC under grants 91418204 and 61625206, by CDZ project CAP (GZ 1023), and by the CAS/SAFEA International Partnership Program for Creative Research Teams; the third author is supported partly by NSFC under grants 11290141, 11271034 and 61532019. This paper was recommended for publication by Editor .... 2 WANG QIUYE · LI YANGJIA · XIA BICAN · ZHAN NAIJUN on which, we propose a sound and complete algorithm to generate all invariants with a pre-defined template.
منابع مشابه
Generating Polynomial Invariants for Hybrid Systems
We present a powerful computational method for automatically generating polynomial invariants of hybrid systems with linear continuous dynamics. When restricted to linear continuous dynamical systems, our method generates a set of polynomial equations (algebraic set) that is the best such over-approximation of the reach set. This shows that the set of algebraic invariants of a linear system is ...
متن کاملGenerating Polynomial Invariants with DISCOVERER and QEPCAD
This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invariants represented as a semialgebraic system are more expressive than those generated with the wellestablished approaches in the literature, which are normally represented as a conjunction of polynomial equations. We implement t...
متن کاملRealization Theory for Discrete-Time Semi-algebraic Hybrid Systems
We present realization theory for a class of autonomous discrete-time hybrid systems called semi-algebraic hybrid systems. These are systems in which the state and output equations associated with each discrete state are defined by polynomial equalities and inequalities. We first show that these systems generate the same output as semi-algebraic systems and implicit polynomial systems. We then ...
متن کاملGeneration of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi-algebraic sets, i.e., sets defined by conjunctions of polynomial inequalities, by means of convex polyhedra. While improving on the existing methods for generating invariant polynomial equalities, since polynomial in...
متن کاملConstructing Invariants for Hybrid Systems
We present a new method for generating algebraic invariants of hybrid systems. The method reduces the invariant generation problem to a constraint solving problem using techniques from the theory of ideals over polynomial rings. Starting with a template invariant – a polynomial equality over the system variables with unknown coefficients – constraints are generated on the coefficients guarantee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Systems Science & Complexity
دوره 30 شماره
صفحات -
تاریخ انتشار 2017